A Parallel Solution to the Approximate String Matching Problem
نویسندگان
چکیده
منابع مشابه
Efficient Parallel And Serial Approximate String Matching
Consider the string matching problem, where differences between characters of the pattern and characters of the text are allowed. Each difference is due to either a mismatch between a character of the text and a character of the pattern or a superfluous character in the text or a superfluous character in the pattern. Given a text of length n, a pattern of length m and an integer k, we present p...
متن کاملFaster Bit-Parallel Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The rst one Myers, J. of the ACM, 1999], searches for a pattern of length m in a text of length n permitting k diierences in O(mn=w) time, where w is the width of the computer word. The second one Navarro and Raanot, ACM JEA, 2000], extends a sublinear-time exact algorithm to approximat...
متن کاملA Parallel Approach to Solve the Approximation String Matching Problem
m p p p P 2 1 and an error bound k, we are asked to find whether there exists a prefix of T whose edit distance with P is smaller than or equal to k. The edit dance between A and B is the minimum number of insertion, deletion and substitution operations needed to transform B into A[4]. This problem can be computed by using dynamic programming method [5, 14]. Many approximate string matching...
متن کاملO(k) Parallel Algorithms for Approximate String Matching Approximate String Matching (proposed Running Head)
Given a text string T of length n, a shorter pattern string A of length m, and an integer k, an simple straightforward O(k) parallel algorithm for nding all occurrences of the pattern string in the text string with at most k di erences (as de ned by edit distance) is presented. The algorithm uses the priority CRCW-PRAM model of computation and (n m+ k + 2) m = O(n m) processors. Over recent dec...
متن کاملBit-Parallel Approach to Approximate String Matching in Compressed Texts
In this paper, we address the problem of approximate string matching on compressed text. We consider this problem for a text string described in terms of collage system, which is a formal system proposed by Kida et al. (1999) that captures various dictionary-based compression methods. We present an algorithm that exploits bit-parallelism, assuming that our problem fits in a single machine word,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1992
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/35.5.524